Another generalization of the m-topology

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalization of M-Small Modules

In this paper we introduce a generalization of M-small modules and discuss about the torsion theory cogenerated by this kind of modules in category . We will use the structure of the radical of a module in  and get some suitable results about this class of modules. Also the relation between injective hull in  and this kind of modules will be investigated in this article.   For a module  we show...

متن کامل

CHARACTERIZATIONS OF (L;M)-FUZZY TOPOLOGY DEGREES

In this paper, characterizations of the degree to which a mapping $mathcal{T} : L^{X}longrightarrow M$ is an $(L, M)$-fuzzy topology are studied in detail.What is more, the degree to which an $L$-subset is an $L$-open set with respect to $mathcal{T}$ is introduced.Based on that, the degrees to which a mapping $f: Xlongrightarrow Y$ is continuous,open, closed or a quotient mapping with respect t...

متن کامل

Another Generalization of the Reed-Muller Codes

The punctured binary Reed-Muller code is cyclic and was generalized into the punctured generalized ReedMuller code over GF(q) in the literature. The major objective of this paper is to present another generalization of the punctured binary Reed-Muller code. Another objective is to construct a family of reversible cyclic codes that are related to the newly generalized Reed-Muller codes. Index Te...

متن کامل

Generalized statistics: yet another generalization

We provide a unifying axiomatics for Rényi’s entropy and non–extensive entropy of Tsallis. It is shown that the resulting entropy coincides with Csiszár’s measure of directed divergence known from communication theory.

متن کامل

Another Generalization of Wiener's Attack on RSA

A well-known attack on RSA with low secret-exponent d was given by Wiener in 1990. Wiener showed that using the equation ed − (p − 1)(q − 1)k = 1 and continued fractions, one can efficiently recover the secret-exponent d and factor N = pq from the public key (N, e) as long as d < 1 3 N 1 4 . In this paper, we present a generalization of Wiener’s attack. We show that every public exponent e that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematical Forum

سال: 2014

ISSN: 1314-7536

DOI: 10.12988/imf.2014.415